The K-way Refinement Tree Partitioning Method for Adaptive Grids
ثبت نشده
چکیده
منابع مشابه
A refinement-tree based partitioning method for dynamic load balancing with adaptively refined grids
The partitioning of an adaptive grid for distribution over parallel processors is considered in the context of adaptive multilevel methods for solving partial differential equations. A partitioning method based on the refinement-tree is presented. This method applies to most types of grids in two and three dimensions. For triangular and tetrahedral grids, it is guaranteed to produce connected p...
متن کاملRefinement Tree Based Partitioning for Adaptive Grids
We present a new partitioning algorithm for grids obtained by adaptive reenement. The method uses the adaptive reenement tree to obtain information unavailable to other partitioning methods which use only the nal grid and/or some geometric data. The algorithm requires (typically) O(log(N)) operations after an O(N) preprocessing step. The method is guaranteed to produce perfectly balanced connec...
متن کاملFast Volume Rendering of Sparse Datasets Using Adaptive Mesh Refinement
In this paper we present an algorithm that accelerates 3D texturebased volume rendering of large and sparse data sets. A hierarchical data structure (known as AMR tree) consisting of nested uniform grids is employed in order to efficiently encode regions of interest. The hierarchies resulting from this kind of space partitioning yield a good balance between the amount of volume to render and th...
متن کاملA TVD principle and conservative TVD schemes for adaptive Cartesian grids
Modern high-resolution conservative numerical schemes (see [1–3]) are widely used for simulating flows of liquids, gases, or plasmas. They provide a robust and accurate method for capturing discontinuities, such as shock waves. A total-variation-diminishing (TVD) principle is an important element of such schemes. A TVD scheme is constructed in such a way that the total variation, TV 1⁄4 P ikUi ...
متن کاملForestClaw: A parallel algorithm for patch-based adaptive mesh refinement on a forest of quadtrees
We describe a parallel, adaptive, multiblock algorithm for explicit integration of time dependent partial differential equations on two-dimensional Cartesian grids. The grid layout we consider consists of a nested hierarchy of fixed size, non-overlapping, logically Cartesian grids stored as leaves in a quadtree. Dynamic grid refinement and parallel partitioning of the grids is done through the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999